Global Matrix Constraints
نویسندگان
چکیده
We study the propagation of constraints that apply to a whole matrix of decision variables. We identify several cases where propagation is fixed parameter tractable, as well as other cases where propagation is intractable. We find that the number of rows (or columns) in the matrix as a useful parameter in describing the complexity of propagation of such matrix constraints.
منابع مشابه
Using an Efficient Penalty Method for Solving Linear Least Square Problem with Nonlinear Constraints
In this paper, we use a penalty method for solving the linear least squares problem with nonlinear constraints. In each iteration of penalty methods for solving the problem, the calculation of projected Hessian matrix is required. Given that the objective function is linear least squares, projected Hessian matrix of the penalty function consists of two parts that the exact amount of a part of i...
متن کاملGlobal Quadratic Minimization over Bivalent Constraints: Necessary and Sufficient Global Optimality Condition
In this paper, we establish global optimality conditions for quadratic optimization problems with quadratic equality and bivalent constraints. We first present a necessary and sufficient condition for a global minimizer of quadratic optimization problems with quadratic equality and bivalent constraints. Then, we examine situations where this optimality condition is equivalent to checking the po...
متن کاملSeparable programming problems with the max-product fuzzy relation equation constraints
In this paper, the separable programming problem subject to Fuzzy Relation Equation (FRE) constraints is studied. It is decomposed to two subproblems with decreasing and increasing objective functions with the same constraints. They are solved by the maximum solution and one of minimal solutions of its feasible domain, respectively. Their combination produces the original optimal solution. The ...
متن کاملGlobal least squares solution of matrix equation $sum_{j=1}^s A_jX_jB_j = E$
In this paper, an iterative method is proposed for solving matrix equation $sum_{j=1}^s A_jX_jB_j = E$. This method is based on the global least squares (GL-LSQR) method for solving the linear system of equations with the multiple right hand sides. For applying the GL-LSQR algorithm to solve the above matrix equation, a new linear operator, its adjoint and a new inner product are dened. It is p...
متن کاملSufficient conditions for global optimality of semidefinite optimization
* Correspondence: [email protected] Department of Mathematics, Yibin University, Yibin, Sichuan 644007, China Full list of author information is available at the end of the article Abstract In this article, by using the Lagrangian function, we investigate the sufficient global optimality conditions for a class of semi-definite optimization problems, where the objective function are general non...
متن کامل